Twisted Conjugacy in Braid Groups
نویسندگان
چکیده
In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids u, v ∈ Bn and an automorphism φ ∈ Aut(Bn), decides whether v = (φ(x))−1ux for some x ∈ Bn. As a corollary, we deduce that each group of the form Bn o H, a semidirect product of the braid group Bn by a torsion-free hyperbolic group H, has solvable conjugacy problem.
منابع مشابه
Twisted Conjugacy Classes in Symplectic Groups, Mapping Class Groups and Braid Groups
We prove that the symplectic group Sp(2n,Z) and the mapping class group ModS of a compact surface S satisfy the R∞ property. We also show that Bn(S), the full braid group on n-strings of a surface S, satisfies the R∞ property in the cases where S is either the compact disk D, or the sphere S. This means that for any automorphism φ of G, where G is one of the above groups, the number of twisted ...
متن کاملImproving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups
There are recent cryptographic protocols that are based on Multiple Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a method developed by the author and Nuno Franco, originally intended to solve the Conjugacy Search Problem in braid groups.
متن کاملConjugacy problem for braid groups and Garside groups
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee [3]. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).
متن کاملTowards generating secure keys for braid cryptography
Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. Since then, there have been several attempts to break the braid cryptosystem by solving the conjugacy problem in braid groups. In this paper, we first survey all the major attacks on the braid cryptosystem and conclude that the ...
متن کاملConjugacy problem for subgroups with applications to Artin groups and braid type groups
Let G be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in G of any element of G. Let H be a subgroup of G. We give some conditions on H , under which we provide a solution to the conjugacy problem in H . We apply our results to some Artin groups and braid type groups. In particular, we give explicit solutions to the conjugacy probl...
متن کامل